Pisot unit generators in number fields
نویسندگان
چکیده
منابع مشابه
Number Fields without Small Generators
Let D > 1 be an integer, and let b = b(D) > 1 be its smallest divisor. We show that there are infinitely many number fields of degree D whose primitive elements all have relatively large height in terms of b, D and the discriminant of the number field. This provides a negative answer to a questions of W. Ruppert from 1998 in the case when D is composite. Conditional on a very weak form of a fol...
متن کاملA note on generators of number fields
We establish upper bounds for the smallest height of a generator of a number field k over the rational field Q. Our first bound applies to all number fields k having at least one real embedding. We also give a second conditional result for all number fields k such that the Dedekind zeta-function associated to the Galois closure of k/Q satisfies GRH. This provides a partial answer to a question ...
متن کاملCubic Pisot unit combinatorial games
Generalized Tribonacci morphisms are defined on a three letters alphabet and generate the so-called generalized Tribonacci words. We present a family of combinatorial removal games on three piles of tokens whose set of P-positions is coded exactly by these generalized Tribonacci words. To obtain this result, we study combinatorial properties of these words like gaps between consecutive identica...
متن کاملRandom-number Generators Physical Random-number Generators
R andom numbers have applications in many areas: simulation, game-playing, cryptography, statistical sampling, evaluation of multiple integrals, particletransport calculations, and computations in statistical physics, to name a few. Since each application involves slightly different criteria for judging the “worthiness” of the random numbers generated, a variety of generators have been develope...
متن کاملPeriod Distribution of Inversive Pseudorandom Number Generators Over Finite Fields
In this paper, we focus on analyzing the period distribution of the inversive pseudorandom number generators (IPRNGs) over finite field (ZN ,+,×), where N > 3 is a prime. The sequences generated by the IPRNGs are transformed to 2-dimensional linear feedback shift register (LFSR) sequences. By employing the generating function method and the finite field theory, the period distribution is obtain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2018
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2017.11.005